Periodic scheduling with obligatory vacations
نویسندگان
چکیده
منابع مشابه
Periodic scheduling with obligatory vacations
We consider a problem of repeatedly scheduling n jobs on m parallel machines. Each job is associated with a profit that is gained each time the job is completed, and the goal is to maximize the average profit per time unit. Once the processing of a job is completed, it goes on vacation and returns to the system, ready to be processed again, only after its vacation is over. This problem has many...
متن کاملJIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
متن کاملPeriodic Scheduling with Service Constraints
We consider the problem of servicing a number of objects in a discrete time environment. In each period, we may select an object that will receive a service in the period. Each time an object is serviced, we incur a servicing cost dependent on the time since the object’s last service. Problems of this type appear in many contexts, e.g., multiproduct lot-sizing, machine maintenance, and several ...
متن کاملParallel Service with Vacations
We study a system with unlimited service potential where all service requests are served in parallel. The entire system itself becomes unavailable for a random period of time at the first instance that the system becomes idle. A queue builds up while the system is unavailable, and then all waiting customers enter the system simultaneously-each to its own processor-when the system becomes availa...
متن کاملScheduling of periodic connections with flexibility
A wavelength division multiplexed link is to be time shared by a given collection of optical connections. The system is time slotted with period T. Each optical connection has a prescribed duration per time period. In addition, it has a prescribed time window within which its duration may begin. The size of the window is the amount of time flexibility there is to schedule the optical connection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.08.008